(2,1)-quasitopos?
structures in a cohesive (∞,1)-topos
An -connected object is an object all whose homotopy groups equal to or below degree are trivial.
More precisely, an object in an ∞-stack (∞,1)-topos is -connected if its categorical homotopy groups equal to or below degree are trivial.
The complementary notion is that of an n-truncated object of an (∞,1)-category.
The Whitehead tower construction produces -connected objects.
Definition 2.1. An object in an (∞,1)-topos is called -connected for if
the terminal morphism is an effective epimorphism;
all categorical homotopy groups equal to or below degree are trivial.
A morphism in an -topos is called -connected if
regarded as an object in the over-(∞,1)-category all categorical homotopy groups equal to or below degree are trivial.
This appears as HTT, def. 6.5.1.10, but under the name “-connective”. Another possible term is “-simply connected”; see n-connected space for discussion.
One adopts the following convenient terminology.
Every object is -connected.
A -connected object is also called an inhabited object.
A 0-connected object is simply called a connected object.
Notice that effective epimorphisms are precisely the -connected morphisms. For more on this see n-connected/n-truncated factorization system.
Proposition 3.1. An object is -connected, def. 2.1, precisely if its n-truncation is the terminal object of (hence precisely if it is -comodal).
This is HTT, prop. 6.5.1.12.
Lemma 3.2. Every equivalence is -connected.
This is HTT, prop. 6.5.1.16, item 2.
Remark 3.3. In a general -topos the converse is not true: not every -connected morphisms needs to be an equivalence. It is true in a hypercomplete (∞,1)-topos.
Proposition 3.4. The class of -connected morphisms is stable under pullback and pushout.
If the pullback of a morphism along an effective epimorphism is -connected, then so is the original morphism.
This is HTT, prop. 6.5.1.16, item 6.
Proposition 3.5. A morphism is -connected precisely if it is an effective epimorphism and the diagonal morphism into the (∞,1)-pullback
is -connected.
This appears as HTT, prop. 6.5.1.18.
Proposition 3.6. Let be an (∞,1)-topos. For all the class of -connected morphisms in forms the left class in a orthogonal factorization system in an (∞,1)-category. The right class is that of n-truncated morphisms in .
See also n-connected/n-truncated factorization system.
This appears as a remark in HTT, Example 5.2.8.16. A construction of the factorization in terms of a model category presentation is in (Rezk, prop. 8.5).
In a hypercomplete (∞,1)-topos the -connected morphisms are precisely the equivalences.
Therefore in such a context we have the following “clock” of notions of truncated object in an (infinity,1)-category / connected :
any morphism = -connected
effective epimorphism = -connected
0-connected, 1-connected, 2-connected, ;
-connected = equivalence = -truncated
monomorphism = -truncated
0-truncated, 1-truncated, 2-truncated,
-truncated = any morphism
In the the (∞,1)-category Top we have that an object is -connected precisely if it is an n-connected topological space:
a -connected object is an inhabited space.
a -connected object is a path-connected space.
a -connected object is a simply connected space.
a -connected object is a contractible space.
More generally, a continuous function represents an -connected morphism in precisely if it is an n-connected continuous function (“n-equivalence”).
Proposition 4.1. Let be a functor between groupoids. Regarded as a morphism in ∞Grpd is 0-connected precisely if it is an essentially surjective and full functor.
Proof. As discussed there, an effective epimorphism in ∞Grpd between 1-groupoids is precisely an essentially surjective functor.
So it remains to check that for an essentially surjective , being 0-connected is equivalent to being full.
The homotopy pullback is given by the groupoid whose objects are triples and whose morphisms are corresponding tuples of morphisms in making the evident square in commute.
By prop. 3.5 it is sufficient to check that the diagonal functor is (-1)-connected, hence, as before, essentially surjective, precisely if is full.
First assume that is full. Then for any object, by fullness of there is a morphism in , such that .
Accordingly we have a morphism in
to an object in the diagonal.
Conversely, assume that the diagonal is essentially surjective. Then for every pair of objects such that there is a morphism we are guaranteed morphisms and such that
Therefore is a preimage of under , and hence is full. ▮
See also (eso+full, faithful) factorization system.
Section 6.5.1 of
A discussion in terms of model category presentations is in section 8 of
Last revised on April 20, 2023 at 07:19:53. See the history of this page for a list of all contributions to it.